A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization
نویسندگان
چکیده
We develop a hybrid iterative approach for computing solutions to large-scale illposed inverse problems via Tikhonov regularization. We consider a hybrid LSMR algorithm, where Tikhonov regularization is applied to the LSMR subproblem rather than the original problem. We show that, contrary to standard hybrid methods, hybrid LSMR iterates are not equivalent to LSMR iterates on the directly regularized Tikhonov problem. Instead, hybrid LSMR leads to a different Krylov subspace problem. We show that hybrid LSMR shares many of the benefits of standard hybrid methods such as avoiding semiconvergence behavior. In addition, since the regularization parameter can be estimated during the iterative process, it does not need to be estimated a priori, making this approach attractive for large-scale problems. We consider various methods for selecting regularization parameters and discuss stopping criteria for hybrid LSMR, and we present results from image processing.
منابع مشابه
A numerical approach for solving a nonlinear inverse diusion problem by Tikhonov regularization
In this paper, we propose an algorithm for numerical solving an inverse non-linear diusion problem. In additional, the least-squares method is adopted tond the solution. To regularize the resultant ill-conditioned linear system ofequations, we apply the Tikhonov regularization method to obtain the stablenumerical approximation to the solution. Some numerical experiments con-rm the utility of th...
متن کاملExtension of GKB-FP algorithm to large-scale general-form Tikhonov regularization
In a recent paper [24] an algorithm for large-scale Tikhonov regularization in standard form called GKB-FP was proposed and numerically illustrated. In this paper, further insight into the convergence properties of this method is provided and extensions to general-form Tikhonov regularization are introduced. In addition, as alternative to Tikhonov regularization, a preconditioned LSQR method co...
متن کاملOn a generalization of Regińska's parameter choice rule and its numerical realization in large-scale multi-parameter Tikhonov regularization
A crucial problem concerning Tikhonov regularization is the proper choice of the regularization parameter. This paper deals with a generalization of a parameter choice rule due to Regińska (1996) [31], analyzed and algorithmically realized through a fast fixed-point method in Bazán (2008) [3], which results in a fixed-point method for multi-parameter Tikhonov regularization called MFP. Like the...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملGCV for Tikhonov regularization via global Golub-Kahan decomposition
Generalized Cross Validation (GCV) is a popular approach to determining the regularization parameter in Tikhonov regularization. The regularization parameter is chosen by minimizing an expression, which is easy to evaluate for small-scale problems, but prohibitively expensive to compute for large-scale ones. This paper describes a novel method, based on Gauss-type quadrature, for determining up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 37 شماره
صفحات -
تاریخ انتشار 2015